Infinite Time Decidable Equivalence Relation Theory
نویسندگان
چکیده
منابع مشابه
Behavioural Equivalence for Infinite Systems - Partially Decidable!
For finite-state systems non-interleaving equivalences are computation-ally at least as hard as interleaving equivalences. In this paper we showthat when moving to infinite-state systems, this situation may changedramatically.We compare standard language equivalence for process description lan-guages with two generalizations based on traditional approaches captur-ing...
متن کاملEventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals
We characterise explicitly the decidable predicates on integers of Innnite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down , the least ordinal not the length of any eventual output of an Innnite Time Turing machine (halting or otherwise); using this the Innnite Time Turing Degrees are considered, and it is shown how the jump ope...
متن کاملOn Infinite Transition Graphs Having a Decidable Monadic Theory
We deene a family of graphs whose monadic theory is (in linear space) reducible to the monadic theory S2S of the complete ordered binary tree. This family contains strictly the context-free graphs investigated by Muller and Schupp, and also the equational graphs deened by Courcelle. Using words as representations of vertices, we give a complete set of representatives by preex rewriting of ratio...
متن کاملOn Infinite Terms Having a Decidable Monadic Theory
We study a transformation on terms consisting of applying an inverse deterministic rational mapping followed by an unfolding. Iterating these transformations from the regular terms gives a hierarchy of families of terms having a decidable monadic theory. In particular, the family at level 2 contains the morphic innnite words investigated by Carton and Thomas. We show that this hierarchy coincid...
متن کاملInfinite Time Computable Model Theory
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time theory generalizes to the infinite time context, but several fundamental questions, including the infinite time computable analogue of the Completeness Theorem, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2011
ISSN: 0029-4527
DOI: 10.1215/00294527-1306199